Fibres and ordered set coloring
نویسندگان
چکیده
منابع مشابه
Fibres and ordered set coloring
A Jbre F of a partially ordered set P is a subset which intersects each nontrivial maximal antichain of P. Let I be the smallest constant such that each finite partially ordered set P contains a fibre of size at most I ‘1 PI. We show that 1, < 3 by finding a good 3-coloring of the nontrivial antichains of P. Some decision problems involving iibres are also considered. For instance, it is shown ...
متن کاملOrdered Coloring Grids and Related Graphs
We investigate a coloring problem, called ordered coloring, in grids and some other families of grid-like graphs. Ordered coloring (also known as vertex ranking) is related to conflict-free coloring and other traditional coloring problems. Such coloring problems can model (among others) efficient frequency assignments in cellular networks. Our main technical results improve upper and lower boun...
متن کاملOrdered coloring of grids and related graphs
We investigate a coloring problem, called ordered coloring, in grids and some other families of grid-like graphs. Ordered coloring (also known as vertex ranking) has applications, among other areas, in efficient solving of sparse linear systems of equations and scheduling parallel assembly of products. Our main technical results improve upper and lower bounds for the ordered chromatic number of...
متن کاملSampling of Multiple Variables Based on Partially Ordered Set Theory
We introduce a new method for ranked set sampling with multiple criteria. The method relaxes the restriction of selecting just one individual variable from each ranked set. Under the new method for ranking, units are ranked in sets based on linear extensions in partially order set theory with considering all variables simultaneously. Results willbe evaluated by a relatively extensive simulation...
متن کاملColoring and Maximum Independent Set of Rectangles
In this paper, we consider two geometric optimization problems: Rectangle Coloring problem (RCOL) and Maximum Independent Set of Rectangles (MISR). In RCOL, we are given a collection of n rectangles in the plane where overlapping rectangles need to be colored differently, and the goal is to find a coloring that minimizes the number of colors. Let q be the maximum clique size of the instance, i....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1991
ISSN: 0097-3165
DOI: 10.1016/0097-3165(91)90083-s